package 网易互联网20210821;

import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;
import java.util.Scanner;

/**
 @author fujiangnan
 @create 2021-08-21-14-45
 @desc 第一题，求小于M的组合数
 排序后+双指针
 */
public class Main {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        String s1 = in.nextLine();
        String[] s = s1.split(" ");
        String s2 = in.nextLine();
        int target = s2.charAt(0)- '0';
        int[] arr = new int[s.length];
        for (int i = 0; i < s.length; i++) {
            arr[i] = Integer.parseInt(s[i]);
        }
        Arrays.sort(arr);
        
        int res = numSum(arr, target);
        System.out.println(res);

    }
    public static int numSum(int[] arr, int target) {
        return 0;
    }

}
